منابع مشابه
Improved incremental prime number sieves
An algorithm due to Bengalloun that continuously enumerates the primes is adapted to give the rst prime number sieve that is simultaneously sublinear, additive, and smoothly incremental: { it employs only (n= log log n) additions of numbers of size O(n) to enumerate the primes up to n, equalling the performance of the fastest known algorithms for xed n; { the transition from n to n + 1 takes on...
متن کاملBook Review: Contemporary Sensorimotor Theory
Consciousness, with its irreducible subjective character, was almost exclusively a philosophical topic until relatively recently. Today, however, the problem of explaining the felt quality of experience has also become relevant to science and engineering, including robotics andAI: “What would we have to build into a robot so that it really felt the touch of a finger, the redness of red, or the ...
متن کاملBook Review: Cryptonomicon, Volume 46, Number 11
Of course, cryptography is necessary for a project such as the data haven, and, as the title would imply, discussions of codes and ciphers run throughout the book. Mathematicians with a background in cryptanalysis might be especially interested in a new output-feedback mode stream cipher formally introduced in this book for the first time. The code is described in greater detail in an appendix ...
متن کاملThe Book Review Column 1 a Course in Computational Algebraic Number Theory
4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons. Review by Robert J. Irwin. My short description can do no better than to quote the review itself: Simmons’s text, whose thrust is pedagogical, intends to be a notquite-one-stop-shopping experience for readers interested in the interplay between the kinds of symbol-pushing undertaken in logic and i...
متن کاملThe Combinatorics behind Number-Theoretic Sieves
Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated re nements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more and more areas of combinatorics where sieve methods (or M obius inversion) are applicable. Unfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 2002
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-02-00957-6